A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs
نویسندگان
چکیده
Given a graph G = (V,E) with n vertices and an integer k 6 n, Max k-Vertex Cover consists of determining a subset K ⊆ V that covers the most of edges in E. We study the polynomial approximation of Max k-Vertex Cover in bipartite graphs by a purely combinatorial algorithm and present an experimental analysis of it that finds the worst case approximation guarantee that is bounded below by 0.794. This improves on the currently best known 3/4-approximation ratio for general graphs (A. A. Ageev and M. Sviridenko, Approximation algorithms for maximum coverage and max cut with given sizes of parts, Proc. IPCO’99).
منابع مشابه
Combinatorial approximation of maximum k-vertex cover in bipartite graphs within ratio~0.7
We propose a purely combinatorial algorithm for max k-vertex cover in bipartite graphs, achieving approximation ratio 0.7. The only combinatorial algorithms currently known until now for this problem are the natural greedy algorithm, that achieves ratio (e−1)/e = 0.632, and an easy 2/3-approximation algorithm presented in [4].
متن کاملDifferential Approximation Algorithms for Some Combinatorial Optimization Problems
We use a new approximation measure, the differential approximation ratio, to derive polynomial-time approximation algorithms for minimum set covering (for both weighted and unweighted cases), minimum graph coloring and bin-packing. We also propose differentialapproximation-ratio preserving reductions linking minimum coloring, minimum vertex covering by cliques, minimum edge covering by cliques ...
متن کاملThe generalized vertex cover problem and some variations
In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming problem and also equivalent to some other variations of the general GVC. Some solvable cases are identified and approximation algorithms are suggested for special ...
متن کاملBounding cochordal cover number of graphs via vertex stretching
It is shown that when a special vertex stretching is applied to a graph, the cochordal cover number of the graph increases exactly by one, as it happens to its induced matching number and (Castelnuovo-Mumford) regularity. As a consequence, it is shown that the induced matching number and cochordal cover number of a special vertex stretching of a graph G are equal provided G is well-covered bipa...
متن کاملOnline Vertex Cover and Matching: Beating the Greedy Algorithm
In this paper, we explicitly study the online vertex cover problem, which is a natural generalization of the well-studied ski-rental problem. In the online vertex cover problem, we are required to maintain a monotone vertex cover in a graph whose vertices arrive online. When a vertex arrives, all its incident edges to previously arrived vertices are revealed to the algorithm. For bipartite grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016